Gradient Projection Iterative Sketch for Large-Scale Constrained Least-Squares

نویسندگان

  • Junqi Tang
  • Mohammad Golbabaee
  • Mike E. Davies
چکیده

We propose a randomized first order optimization algorithm Gradient Projection Iterative Sketch (GPIS) and an accelerated variant for efficiently solving large scale constrained Least Squares (LS). We provide the first theoretical convergence analysis for both algorithms. An efficient implementation using a tailored linesearch scheme is also proposed. We demonstrate our methods’ computational efficiency compared to the classical accelerated gradient method, and the variance-reduced stochastic gradient methods through numerical experiments in various large synthetic/real data sets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Hessian Sketch: Fast and Accurate Solution Approximation for Constrained Least-Squares

We study randomized sketching methods for approximately solving least-squares problem with a general convex constraint. The quality of a least-squares approximation can be assessed in different ways: either in terms of the value of the quadratic objective function (cost approximation), or in terms of some distance measure between the approximate minimizer and the true minimizer (solution approx...

متن کامل

Numerical methods for generalized least squares problems

Usually generalized least squares problems are solved by transforming them into regular least squares problems which can then be solved by well-known numerical methods. However, this approach is not very effective in some cases and, besides, is very expensive for large scale problems. In 1979, Paige suggested another approach which consists of solving an equivalent equality-constrained least sq...

متن کامل

Efficiently Optimizing over (Non-Convex) Cones via Approximate Projections

Constrained least squares is a ubiquitous optimization problem in machine learning, statistics, and signal processing. While projected gradient descent is usually an effective algorithm for solving constrained least squares at scale, the projection operator is often the computational bottleneck, especially for complicated constraints. To circumvent this limitation, we extend recent work on appr...

متن کامل

Modulus-Type Inner Outer Iteration Methods for Nonnegative Constrained Least Squares Problems

For the solution of large sparse nonnegative constrained least squares (NNLS) problems, a new iterative method is proposed which uses the CGLS method for the inner iterations and the modulus iterative method for the outer iterations to solve the linear complementarity problem resulting from the Karush-Kuhn-Tucker condition of the NNLS problem. Theoretical convergence analysis including the opti...

متن کامل

Inexact Spectral Projected Gradient Methods on Convex Sets

A new method is introduced for large scale convex constrained optimization. The general model algorithm involves, at each iteration, the approximate minimization of a convex quadratic on the feasible set of the original problem and global convergence is obtained by means of nonmonotone line searches. A specific algorithm, the Inexact Spectral Projected Gradient method (ISPG), is implemented usi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017